A Pseudo Random Number Generator using Permutation Matrices

نویسنده

  • Ji Won Yoon
چکیده

Pseudo random numbers are used in a number of areas such as cryptography and scientific and statistical simulation. Random numbers are crucial in statistics to obtain a uniform distribution for the prior knowledge and integration of Monte Carlo methods in statistical signal processing. In this paper, we propose a new random number generator using permutation matrices. This algorithm has three main ideas: using an extremely large Look-up table (LUT), construction of the LUT by combining several small matrices, and access to the values in the LUT without loading or building the LUT. This pseudo random number generator has several advantages such as scalability and uniform distribution. Other advantages are also discussed in this paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient speech scrambling technique based on chaotic mapping and pseudorandom binary scrambling

To enhance the information security in network communications, this paper suggests a new speech scrambling algorithm based on random permutation, chaotic mapping and pseudo random binary scrambling.Firstly random permutation algorithm is used to shuffle the rows of the original speech followed by shuffling the rows using chaotic Bernoulli mapping. This produces an intermediary scrambled speech....

متن کامل

One-stroke polynomials over a ring of modulo $2^w$

Permutation polynomials over a ring of modulo 2w are compatible with digital computers and digital signal processors, and so they are in particular expected to be useful for cryptography and pseudo random number generator. In general, the period of the polynomial should be long in such fields. In this paper, we derive the necessary and sufficient condition which specify one-stroke polynomials w...

متن کامل

Generic Attacks on Feistel Schemes

Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2n) computations with O(2n) non-adaptive chosen plaintexts. 2. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O...

متن کامل

A Hybrid Image Cryptosystem Based On OMFLIP Permutation Cipher

The protection of confidential image data from unauthorized access is an important area of research in network communication. This paper presents a high-level security encryption scheme for gray scale images. The gray level image is first decomposed into binary images using bit scale decomposition. Each binary image is then compressed by selecting a good scanning path that minimizes the total n...

متن کامل

Perfect Block Ciphers with Small Blocks

Existing symmetric encryption algorithms target messages consisting of elementary binary blocks of at least 64 bits. Some applications need a block cipher which operates over smaller and possibly nonbinary blocks, which can be viewed as a pseudo-random permutation of n elements. We present an algorithm for selecting such a random permutation of n elements and evaluating efficiently the permutat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006